On the Intractability of Permuting a Block Code to Minimize Trellis Complexity [Correspondence] - Information Theory, IEEE Transactions on
نویسندگان
چکیده
A novel trellis design technique for both block and convolutional codes based on the Shannon product of component block codes is introduced. Using the proposed technique, structured trellises for block and convolutional codes have been designed. It is shown that the designed trellises are minimal and allow reduced complexity Viterbi decoding. Zndex Terms-Linear codes, trellis structure, product of trellises.
منابع مشابه
On the intractability of permuting a block code to minimize trellis complexity
| An important problem in the theory and application of block code trellises is to nd a coordinate permutation of a given code to minimize the trellis complexity. In this paper we show that the problem of nding a coordinate permutation that minimizes the number of vertices at a given depth in the minimal trellis for a binary linear block code is NP-complete.
متن کاملOn the Trellis Structure of Block Codes - Information Theory, IEEE Transactions on
Abst+act-The problem of minimizing the vertex count at a given time index in the trellis for a general (nonlinear) code is shown to be NP-complete. Examples are provided that show that 1) the minimal trellis for a nonlinear code may not be observable, i.e., some codewords may be represented by more than one path through the trellis and 2) minimizing the vertex count at one time index may be inc...
متن کاملTrellis decoding complexity of linear block codes
AbstructIn this partially tutorial paper, we examine minimal trellis representations of linear block codes and analyze several measures of trellis complexity: maximum state and edge dimensions, total span length, and total vertices, edges and mergers. We obtain bounds on these complexities as extensions of well-known dimensiodlength profile (DLP) bounds. Codes meeting these bounds minimize all ...
متن کاملLower bounds on trellis complexity of block codes
Abstruct-The trellis state-complexity s of a linear block code is defined as the logarithm of the maximum number of states in its minimal trellis. We present a new lower bound on the statecomplexity of linear codes, which includes most of the existing bounds as special cases. The new bound is obtained by dividing the time axis for the code into several sections of varying lengths, as opposed to...
متن کاملUniversal space-time trellis codes
This correspondence gives practical examples of space–time trellis codes performing as predicted by Root and Varaiya’s compound channel theorem. Specifically, 32-state and 64-state 2 2 space–time trellis codes are presented that provide a bit-error rate (BER) of10 on all2 2 matrix channels with an excess mutual information (MI) within 8% of the excess MI required by standard trellis codes of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004